#include<bits/stdc++.h>
using namespace std;

int f[30][30];
int main()
{
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=0;j<=m;j++)
		{
			if(i%2==0 && j%2==0)	continue;
			if(i ==1 && j==1)	f[i][j]=1;
			else if(i ==1)	f[i][j]=1;
			else if(j==1) f[i][j]=1;
			else f[i][j]=f[i-1][j]+f[i][j-1];
		}
	cout<< f[n][m]<<endl;
	return 0;
 } 
